A Dynamic Mapping Algorithm for Graph Isomorphism
نویسندگان
چکیده
منابع مشابه
A Message-Passing Algorithm for Graph Isomorphism
A message-passing procedure for solving the graph isomorphism problem is proposed. The procedure resembles the belief-propagation algorithm in the context of graphical models inference and LDPC decoding. To enable the algorithm, the input graphs are transformed into intermediate canonical representations of bipartite graphs. The matching procedure injects specially designed input patterns to th...
متن کاملA Polynomial Time Algorithm for Graph Isomorphism
Algorithms testing two graphs for isomorphism known as yet in computer science have exponential worst case complexity. In this paper we propose an algorithm that has polynomial complexity and constructively supplies the evidence that the graph isomorphism lies in P.
متن کاملFast Algorithm for Graph Isomorphism Testing
In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using backtracking, with a (possibly partial) automorphism precomputing that allows to prune the search tree. We propose an algorithm, conauto, that has a space complexity of O(n log n) bits. It runs in time O(n) with high probabilit...
متن کاملPolynomial Time Algorithm for Graph Isomorphism Testing
Earlier we introduced (M.I.Trofimov, E.A.Smolenskii, Application of the Electronegativity Indices of Organic Molecules to Tasks of Chemical Informatics, Russian Chemical Bulletin 54(2005), 2235-2246. http://dx.doi.org/10.1007/s11172-006-0105-6) effective recursive algorithm for graph isomorphism testing. In this paper we describe used approach and iterative modification of this algorithm, which...
متن کاملA new ltering algorithm for the graph isomorphism problem
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem may be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less e cient than dedicated algorithms which take advantage of the global semantic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.10.374